|
|
ISP Network Optimalization
Čech, Ondřej ; Podermański, Tomáš (referee) ; Grégr, Matěj (advisor)
Bachoelor's thesis is focusing on analysis of network local ISP, detecting actual problems and offering a solution for founded problems. There were problems with broadcast-storm, private address space, RSTP protocol settings and DHCP spoofing. The following changes were introduced: OSPF routing, RSTP override, automatic backup, client separation using DHCP. There has been a reduction in broadcast traffic and associated broadcast-storm.
|
|
|
ISP Network Optimalization
Čech, Ondřej ; Podermański, Tomáš (referee) ; Grégr, Matěj (advisor)
Bachoelor's thesis is focusing on analysis of network local ISP, detecting actual problems and offering a solution for founded problems. There were problems with broadcast-storm, private address space, RSTP protocol settings and DHCP spoofing. The following changes were introduced: OSPF routing, RSTP override, automatic backup, client separation using DHCP. There has been a reduction in broadcast traffic and associated broadcast-storm.
|
|
|
Support of management decision-making on transport networks
Přibyl, Vladimír ; Černý, Jan (advisor) ; Kavička, Antonín (referee) ; Peško, Štefan (referee)
The presented thesis is focused on a set of problems related to managerial decision-making concerning networks (particularly transportation networks), respectively - if we put it more precisely - the thesis focuses on the support of this decision-making by means of quantitative methods. A set of problems related to nets and decision-making concerning their individual parts or elements represents a very complex sphere which has been a subject of research for a number of decades. Out of this sphere, the thesis formulates and elaborates in great detail two problems, which - from the point of view of their practical significance - are important for the decision-making of managers of carriers, or the public sphere, and which have not been published in this form yet. The main point is the problem of how to find a subnet with a limited prolongation of routes between important pairs of vertices. Another problem is a design of a bus route in an area with a low demand. For each of these problems, the thesis offers an exact combinatorial solution method, furthermore a method based on integer linear programming, and - last but not least - also, of course, heuristic methods of solution. All these methods have been tested on a set of networks, which has been created for this purpose in a pseudo-random way in the frame of this thesis. The testing has been focused primarily on the comparison of the results provided by heuristic methods, which are of great importance - with regard to a great computational difficulty of exact methods - for feasible tasks on a larger scale. The tests have proved that the proposed heuristic methods are practically applicable and show results whicheven represent the optimal solution in a number of cases, or are only slightly distant from the optimal solution.
|
guest ::
